Fully Dynamic Planarity Testing in Planar Embedded Graphs (Extended Abstract)
نویسندگان
چکیده
We present the rst data structure to maintain an embedded planar graph under arbitrary edge insertions, arbitrary edge deletions and queries that test whether the insertion of a new edge would violate the planarity of the embedding. Our data structure supports online updates and queries on an n{vertex embedded planar graph in O(log 2 n) worst{case time, it can be built in O(n) time and requires O(n) space.
منابع مشابه
Planarity testing of doubly periodic infinite graphs
This paper describes an efficient way to test the VAP-free (Vertex Accumulation Point free) planarity of oneand two-dimensional dynamic graphs. Dynamic graphs are infinite graphs consisting of an infinite number of basic cells connected regularly according to labels in a finite graph called a sraric graph. Dynamic graphs arize in the design of highly regular VLSI circuits, such as systolic arra...
متن کاملEfficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
Let C be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the c-planarity of C easier than in the variable embedding setting? In this paper we give a first contribution towards answering the above question. Namely, we characterize c-planar embedded flat clustered graphs with at most five vertices per face and give an efficient testing algorith...
متن کاملTesting Maximal 1-Planarity of Graphs with a Rotation System in Linear Time - (Extended Abstract)
A 1-planar graph is a graph that can be embedded in the plane with at most one crossing per edge. A 1-planar graph on n vertices can have at most 4n− 8 edges. It is known that testing 1-planarity of a graph is NP-complete. A 1-planar embedding of a graph G is maximal, if no edge can be added without violating the 1-planarity of G. In this paper, we study combinatorial properties of maximal 1-pl...
متن کاملTesting Full Outer-2-planarity in Linear Time
A graph is 1-planar, if it admits a 1-planar embedding, where each edge has at most one crossing. Unfortunately, testing 1-planarity of a graph is known as NP-complete. This paper considers the problem of testing 2-planarity of a graph, in particular,testing full outer-2planarity of a graph. A graph is fully-outer-2-planar, if it admits a fully-outer-2-planar embedding such that every vertex is...
متن کاملSeparator Based Sparsification. I. Planary Testing and Minimum Spanning Trees
We describe algorithms and data structures for maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We give a fully dynamic planarity testing algorithm that maintains a graph subject to edge insertions and deletions and that allows queries that test whether the graph is currently planar, or whether a potentia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993